Posts tagged with Coding Patterns
Sep 11 2025
The fast and slow pointer technique is an extension of the two-pointer concept. Instead of moving both pointers at the same speed, one pointer moves one step at a time (slow), while the other moves two steps at a time (fast).
Sep 10 2025
A linked list is a dynamic data structure made up of nodes. Each node contains data and a pointer (or reference) to the next node.
Sep 8 2025
HashMaps (also called dictionaries or hash tables) are fundamental data structures that allow for fast average-time operations for insert, delete, and lookup all in O(1).
Sep 7 2025
The two-pointer technique refers to an algorithm that uses two pointers (indices) to navigate within a data structure such as an array or linked list.
Hi, I'm Samarth. I'm a software engineer based in Los Angeles. You can follow me on Twitter, see some of my work on GitHub, or read more about me on LinkedIn.
